About the Linear Complexity of Binary Sequences with Optimal Autocorrelation Value/Magnitude and Length 4p
نویسنده
چکیده
We derive the linear complexity and the minimal polynomial over the finite fields of order two and p of series of binary sequences with a period 4p and optimal autocorrelation value/magnitude. These sequences are constructed by cyclotomic classes of order two, four and six by methods proposed by K.T. Arasu et al. and Y. Sun et al. We define the parameters of sequences with optimal autocorrelation and high linear complexity. Keywords—random sequences, autoregression model, uniform distribution
منابع مشابه
The Linear Complexity of a Class of Binary Sequences With Optimal Autocorrelation
Binary sequences with optimal autocorrelation and large linear complexity have important applications in cryptography and communications. Very recently, a class of binary sequences of period 4p with optimal autocorrelation was proposed by interleaving four suitable Ding-Helleseth-Lam sequences (Des. Codes Cryptogr., DOI 10.1007/s10623-017-0398-5), where p is an odd prime with p ≡ 1( mod 4). The...
متن کاملThe linear complexity and the autocorrelation of generalized cyclotomic binary sequences of length 2p
In this article, we generalize results about binary sequences of length 2p and evaluate the linear complexity and autocorrelation properties of generalized cyclotomic binary sequences of length 2p. We show that in most cases these sequences have high linear complexity and poor autocorrelation performance.
متن کاملThe evaluation of the linear complexity and the autocorrelation of generalized cyclotomic binary sequences of length 2p
In this article, we discuss a computation method for the linear complexity of generalized cyclotomic binary sequences of length 2p. This method allows to assess the linear complexity of above-mentioned sequences and to design the sequences with high linear complexity. Also we generalize known results about binary sequences of length 2p. In conclusion we evaluate the autocorrelation of generaliz...
متن کاملNew Optimal Binary Sequences with Period $4p$ via Interleaving Ding-Helleseth-Lam Sequences
Binary sequences with optimal autocorrelation play important roles in radar, communication, and cryptography. Finding new binary sequences with optimal autocorrelation has been an interesting research topic in sequence design. Ding-Helleseth-Lam sequences are such a class of binary sequences of period p, where p is an odd prime with p ≡ 1(mod 4). The objective of this letter is to present a con...
متن کاملLinear Complexity and Autocorrelation of two Classes of New Interleaved Sequences of Period 2N
The autocorrelation and the linear complexity of a key stream sequence in a stream cipher are important cryptographic properties. Many sequences with these good properties have interleaved structure, three classes of binary sequences of period 4N with optimal autocorrelation values have been constructed by Tang and Gong based on interleaving certain kinds of sequences of period N . In this pape...
متن کامل